On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge

On Probabilistic versus Deterministic Provers in the De nition of Proofs Of Knowledge

Implicational Scaling of Reading Comprehension Construct: Is it Deterministic or Probabilistic?

In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...

The Impact of L2 Semantic Tasks (L2 Collocation versus L2 Definition) on Iranian Intermediate EFL Learners’ Vocabulary Achievement

This study investigated the relationship between teaching L2 semantic tasks (collocation vs. definition) in vocabulary achievement of Iranian intermediate EFL learners. To this end, 60 students at intermediate level studying in the Simin Institute were selected from a total number of 100 participants based on their performance on Oxford Placement Test. After ensuring the criterion of homogeneit...

Composition of Zero-Knowledge Proofs with Efficient Provers

We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input). Our results are: 1. When restricted to efficient provers, the original Goldwasser–Micali– Rackoff (GMR) definition of zero knowledge (STOC ‘85), here called plain zero knowledge, is closed under a constant number of ...

Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More

We construct several new statistical zero-knowledge proofs with efficient provers, i.e. ones where the prover strategy runs in probabilistic polynomial time given an NP witness for the input string. Our first proof systems are for approximate versions of the Shortest Vector Problem (SVP) and Closest Vector Problem (CVP), where the witness is simply a short vector in the lattice or a lattice vec...